The exam will be 75 + 15 (for upload) = 90 minutes long. It is open book and open notes. Questions will be full text questions. Many of the topics have already been covered in Quiz 1. The following topics will be covered:

Solutions: Solutions are available here

• SQL: Write SQL queries and evaluate them.

• Relational algebra:

  • Write relational algebra expressions.

  • Translate SQL into relational algebra.

  • Equivalences.

• Index structures

  • B-trees and B+-trees: Execute operations on such trees (insert,delete) and answer questions about their properties (e.g., number of children).

  • Hash indicies: Execute operations on hash indicies (insert, delete) and answer general questions about these data structures (e.g., when to rebuild a directory for extensible hashing).

  • Know spacial index structures.

• Logical query optimization

  • Result size estimation.

• Implementations of relational operators and their I/O cost and runtime complexity:

  • Joins: Nested Loop variants, Merge join, Hash join.

  • Aggregation, Set-operations, Scans.